The Semantics of Intermediate CPTs in Variable Elimination

نویسندگان

  • Cory J. Butz
  • Wen Yan
چکیده

Variable elimination (VE), a central component of Bayesian network inference, starts and ends with clear structure and semantics, yet all intermediate distributions, whether normalized or unnormalized, are denoted as potentials. In this paper, a condition is given stating when intermediate distributions are defined with respect to the joint distribution. Theoretical and practical advantages of these new semantics are given.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Variable Elimination in Discrete Bayesian Network Inference

We are interested in proving that variable elimination (VE) in discrete Bayesian networks always yields a clearly structured conditional probability table (CPT) rather than a potential as universally stated. A Bayesian network consists of a directed acyclic graph and a corresponding set of CPTs. Based on the conditional independencies holding in the directed acyclic graph, the product of the CP...

متن کامل

The CPT Structure of Variable Elimination in Discrete Bayesian Networks

We show that a conditional probability table (CPT) is obtained after every multiplication and every marginalization step when eliminating variables from a discrete Bayesian network. The main advantage of our work is an improvement in presentation. The probability distributions constructed during variable elimination in Bayesian networks have always been denoted as potentials. Since CPTs are a s...

متن کامل

Value Elimination: Bayesian Inference via Backtracking Search

We present Value Elimination, a new algorithm for Bayesian Inference. Given the same variable order­ ing information, Value Elimination can achieve per­ formance that is within a constant factor of variable elimination or recursive conditioning, and on some problems it can perform exponentially better, irrespec­ tive of the variable ordering used by these algorithms. Value Elimination's other f...

متن کامل

Value Elimination: Bayesian Interence via Backtracking Search

We present Value Elimination, a new algorithm for Bayesian Inference. Given the same variable ordering information, Value Elimination can achieve performance that is within a constant factor of variable elimination or recursive conditioning, and on some problems it can perform exponentially better, irrespective of the variable ordering used by these algorithms. Value Elimination’s other feature...

متن کامل

A Linguistic Analysis of Conference Titles in Applied Linguistics

Over the past twenty-five years, researchers have expressed considerable interest in titles of academic publications. Unfortunately, conference paper titles (CPTs) have only recently begun to receive attention. The aim of this study, therefore, is to investigate the text length, syntactic structure, and lexicon of CPTs in Applied Linguistics. A data set of 698 titles was selected from the 2008 ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010